Lambek Grammars as Combinatory Categorial Grammars
نویسنده
چکیده
We propose a combinatory reformulation of the product free version of the categorial calculus LL, i.e. the associative Lambek calculus that admits empty premises. We prove equivalence of the combinatory with the standard Natural Deduction presentation of LL. The result offers a new perspective on the relation between the type logical and the combinatory branch of the Categorial Grammar research program.
منابع مشابه
Syntactic categories and types: Ajdukiewicz and modern categorial grammars
This essay confronts Ajdukiewicz’s approach to syntactic categories with modern categorial grammars, mainly AB-grammars (basic categorial grammars) and Lambek grammars, i.e. categorial grammars based on different versions of the Lambek calculus.
متن کاملRigid Lambek Grammars Are Not Learnable from Strings
This paper is concerned with learning categorial grammars in Gold's model (Gold, 1967). Recently, learning algorithms in this model have been proposed for some particular classes of classical categorial grammars (Kanazawa, 1998). We show that in contrast to classical categorial grammars, rigid and k-valued Lambek grammars are not learnable from strings. This result holds for several variants of...
متن کاملNontransformational Grammar
The class of nontransformational generative grammars comprises frameworks that share many of the broad goals espoused in early transformational work (e.g. Chomsky 1957) but use different devices to pursue these goals. This class of grammars can be divided into three principal subclasses. The family of feature-based approaches, also known variously as ‘unification-based’, ‘constraint-based’ or ‘...
متن کاملConjoinability and unification in Lambek categorial grammars
Recently, learning algorithms in Gold’s model have been proposed for some particular classes of classical categorial grammars [Kan98]. We are interested here in learning Lambek categorial grammars. In general grammatical inference uses unification and substitution. In the context of Lambek categorial grammars it seems appropriate to incorporate an operation on types based both on deduction (Lam...
متن کاملConjunctive Categorial Grammars
Basic categorial grammars are enriched with a conjunction operation, and it is proved that the formalism obtained in this way has the same expressive power as conjunctive grammars, that is, context-free grammars enhanced with conjunction. It is also shown that categorial grammars with conjunction can be naturally embedded into the Lambek calculus with conjunction and disjunction operations. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logic Journal of the IGPL
دوره 9 شماره
صفحات -
تاریخ انتشار 2001